Clan Capitalism, Graph Distance and other issues

نویسنده

  • Florentin Smarandache
چکیده

This book consists of 6 papers focusing on social and economic issues. The topics covered include graph distance and optimal communication, migration in Jaipur, urbanization, clan capitalism, world population growth rate, and scientific inquiry. These papers were written in the period between 20092010. Hopefully the readers will find some new insights in this collection of papers. Collection of Social and Economics papers 1 COLLECTION OF SOCIAL AND ECONOMICS PAPERS by Florentin Smarandache and V. Christianto

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Distance, Optimal Communication and Group Stability: A Preliminary Conjecture

This book consists of 6 papers focusing on social and economic issues. The topics covered include graph distance and optimal communication, migration in Jaipur, urbanization, clan capitalism, world population growth rate, and scientific inquiry. These papers were written in the period between 20092010. Hopefully the readers will find some new insights in this collection of papers. Collection of...

متن کامل

Product version of reciprocal degree distance of composite graphs

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

متن کامل

Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

متن کامل

Global Health in the Anthropocene: Moving Beyond Resilience and Capitalism; Comment on “Health Promotion in an Age of Normative Equity and Rampant Inequality”

There has been much reflection on the need for a new understanding of global health and the urgency of a paradigm shift to address global health issues. A crucial question is whether this is still possible in current modes of global governance based on capitalist values. Four reflections are provided. (1) Ecological–centered values must become central in any future global health framework. (2) ...

متن کامل

Different-Distance Sets in a Graph

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013